447 research outputs found

    General equilibrium programming

    Get PDF
    Equilibrium Theory;Algorithm

    An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders

    Get PDF
    An auctioneer wishes to sell several heterogeneous indivisible items to a group of potential bidders. Each bidder has valuations over the items but faces a budget constraint and may therefore not be able to pay up to his valuations. In such markets, a competitive equilibrium typically fails to exist. We develop a dynamic auction and prove that the auction always finds a core allocation in finitely many rounds. The core allocation consists of an assignment of the items and its associated supporting price vector.Dynamic auction;budget constraint;core

    A Discrete Multivariate Mean Value Theorem with Applications

    Get PDF
    AMS classifications: 47H10; 54H25; 55M20; 90C33; 91B50Discrete set;mean value theorem;fixed point;algorithm;equilibrium;complementarity

    Games With Limited Communication Structure

    Get PDF
    In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate with each other only if they can communicate directly or indirectly with each other. For the class of acyclic graph games recently the average tree solution has been proposed. It was proven that the average tree solution is a core element if the game exhibits superadditivity. It will be shown that the condition of super-additivity can be relaxed to a weaker condition, which admits for a natural interpretation. Moreover, the concept of subcore is introduced. Under the same condition it is proven that the subcore is a subset of the core and always contains the average tree solution and therefore is a non-empty refinement of the core.

    Refinement of solutions to the linear complimentarity problem

    Get PDF
    Nash equilibrium;game theaory;matrices
    corecore